General Arc-flow Formulation with Graph Compression
نویسندگان
چکیده
We present an exact method, based on an arc-flow formulation with side constraints, for solving bin packing and cutting stock problems — including multi-constraint variants — by simply representing all the patterns in a very compact graph. Our method includes a graph compression algorithm that usually reduces the size of the underlying graph substantially without weakening the model. Our formulation is equivalent to Gilmore and Gomory’s, thus providing a very strong linear relaxation. However, instead of using column-generation in an iterative process, the method constructs a graph, where paths from the source to the target node represent every valid packing pattern. The same method, without any problem-specific parameterization, was used to solve a large variety of instances from several different cutting and packing problems. In this paper, we deal with vector packing, bin packing, cutting stock, cardinality constrained bin packing, cutting stock with cutting knife limitation, bin packing with conflicts, and other problems. We report computational results obtained with many benchmark test datasets, some of them showing a large advantage of this formulation with respect to the traditional ones. Preprint submitted to Elsevier 27 November, 2015
منابع مشابه
VPSolver 3: Multiple-choice Vector Packing Solver
VPSolver is a vector packing solver based on an arc-flow formulation with graph compression. In this paper, we present the algorithm introduced in VPSolver 3.0.0 for building compressed arc-flow models for the multiple-choice vector packing problem.
متن کاملMultiple-choice Vector Bin Packing: Arc-flow Formulation with Graph Compression
The vector bin packing problem (VBP) is a generalization of bin packing with multiple constraints. In this problem we are required to pack items, represented by p-dimensional vectors, into as few bins as possible. The multiple-choice vector bin packing (MVBP) is a variant of the VBP in which bins have several types and items have several incarnations. We present an exact method, based on an arc...
متن کاملCutting Stock with Binary Patterns: Arc-flow Formulation with Graph Compression
The cutting stock problem with binary patterns (0-1 CSP) is a variant of CSP that usually appears as a relaxation of 2D and 3D packing problems. We present an exact method, based on an arc-flow formulation with side constraints, for solving 0-1 CSP by simply representing all the patterns in a very compact graph. Gilmore-Gomory’s column generation approach is usually used to compute strong lower...
متن کاملA Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs1
Given a graph G = (V, E) and two vertices s, t ∈ V , s 6= t , the Menger problem is to find a maximum number of disjoint paths connecting s and t . Depending on whether the input graph is directed or not, and what kind of disjointness criterion is demanded, this general formulation is specialized to the directed or undirected vertex, and the edge or arc disjoint Menger problem, respectively. Fo...
متن کامل